A novel approach to finding feasible solutions to personnel rostering problems
نویسندگان
چکیده
Classical meta-heuristic methods for solving rostering problems focus on defining measures of roster quality. Here we present a new case-based reasoning approach to generating repairs of hard constraint violations using expert-human experience. This approach is used to guide heuristic constraint satisfaction algorithms, eliminating the need to explicitly define search objectives.
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملCombining case-based reasoning with tabu search for personnel rostering problems
In this paper we investigate the advantages of using Case-Based Reasoning (CBR) to solve personnel rostering problems. Constraints for personnel rostering problems are commonly categorised as either ‘hard’ or ‘soft’. Hard constraints are those which must be satisfied and a roster which violates none of these constraints is considered to be ‘feasible’. Soft constraints are more flexible and are ...
متن کاملEnhancing case-based reasoning for personnel rostering with selected tabu search concepts
In this paper we investigate the advantages of using Case-Based Reasoning (CBR) to solve personnel rostering problems. Constraints for personnel rostering problems are commonly categorised as either ‘hard’ or ‘soft’. Hard constraints are those which must be satisfied and a roster which violates none of these constraints is considered to be ‘feasible’. Soft constraints are more flexible and are ...
متن کاملVariable Neighbourhood Search for Nurse Rostering Problems
Nurse rostering problems consist of assigning varying tasks, represented as shift types, to hospital personnel with different skills and work regulations. We want to satisfy as many constraints and personal preferences as possible while constructing a schedule which meets the personnel requirements of the hospital over a predefined planning period. Real world situations are often so constrained...
متن کاملDetermining feature weights using a genetic algorithm in a case-based reasoning approach to personnel rostering
Personnel rostering problems are highly constrained resource allocation problems. Human rostering experts have many years of experience in making rostering decisions which reflect their individual goals and objectives. We present a novel method for capturing nurse rostering decisions and adapting them to solve new problems using the Case-Based Reasoning (CBR) paradigm. This method stores exampl...
متن کامل